# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    def missingRolls(self, rolls: List[int], mean: int, n: int) -> List[int]:
        m = len(rolls)
        total_m = sum(rolls)
        total_sum = (m + n) * mean

        remain = total_sum - total_m - mean * n
        ret = [mean] * n

        for i in range(n):
            if remain == 0:
                break
            elif remain > 0:
                adjust_value = 6 - ret[i]
                if remain >= adjust_value:
                    remain -= adjust_value
                else:
                    adjust_value = remain
                    remain = 0

                ret[i] += adjust_value

            elif remain < 0:
                adjust_value = ret[i] - 1
                if remain + adjust_value <= 0:
                    remain += adjust_value
                else:
                    adjust_value = abs(remain)
                    remain = 0
                ret[i] -= adjust_value

        if remain != 0:
            ret = []

        return ret


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1], 3, 1, [5]),
        ([3,2,4,3], 4, 2, [6,6]),
        ([1,5,6], 3, 4,[2,3,2,2]),
        ([1,2,3,4], 6, 4, []),
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        input3 = case_item[2]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.missingRolls(input1, input2, input3)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

